Nominator's project description
| Professor Kučera is an international authority in computer-assisted verification and synthesis of computer systems. He has made important contributions to the theory of process algebras, the analysis of probabilistic systems and the application of game-theoretic techniques to verification and synthesis problems. In Germany, he will study algorithms for the analysis of specific resources and security games with exciting potential applications to the design of resource-aware components and to computer security. |
Publications (partial selection)
| 2003 | Antonin Kucera, Javier Esparza: A Logical Viewpoint on Process-algebraic Quotients. In: Journal of Logic and Computation, 2003, 863-880 |
|---|
| 2003 | Javier Esparza, Antonin Kucera, Stefan Schwoon: Model checking LTL with regular valuations for pushdown systems. In: Information and Computation, 2003, 355-376 |
|---|
| 2002 | Antonin Kucera, Richard Mayr: Simulation Preorder over Simple Process Algebras. In: Information and Computation, 2002, 184-198 |
|---|
| 2002 | Antonin Kucera, Richard Mayr: Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. In: Theoretical Computer Science, 2002, 677-700 |
|---|
| 2001 | Petr Jancar, Antonin Kucera, Richard Mayr: Deciding bisimulation-like equivalences
with finite-state processes. In: Theoretical Computer Science, 2001, 409-433 |
|---|